Hypergraph and Uncertain Hypergraph Representation Learning Theory and Methods
نویسندگان
چکیده
With the advent of big data and information age, magnitude various complex networks is growing rapidly. Many real-life situations cannot be portrayed by ordinary networks, while hypergraphs have ability to describe characterize higher order relationships, which attracted extensive attention from academia industry in recent years. Firstly, this paper described development process, application areas, existing review research hypergraphs; secondly, introduced theory briefly; then, compared learning methods graphs three aspects: matrix decomposition, random walk, deep learning; next, structural optimization perspectives: dynamic hypergraphs, hyperedge weight optimization, multimodal hypergraph generation; after that, applicability uncertain models were analyzed based on uncertainty theories: probability theory, fuzzy set, rough set; finally, future directions prospected.
منابع مشابه
Hypergraph-Based Image Representation
An appropriate image representation induces some good image treatment algorithms. Hypergraph theory is a theory of finite combinatorial sets, modeling a lot of problems of operational research and combinatorial optimization. Hypergraphs are now used in many domains such as chemistry, engineering and image processing. We present an overview of a hypergraph-based picture representation giving muc...
متن کاملModel Theory and Hypergraph Regularity
1. Ultrafilters, ultraproducts and ultralimits 1 1.1. Filters and ultrafilters 1 1.2. Ultralimits 2 1.3. Some model-theoretic notation 3 1.4. Ultraproducts of first-order structures 3 1.5. References 6 2. Graph regularity and measures on ultraproducts 6 2.1. Szemerédi’s regularity lemma 6 2.2. Finitely additive measures 7 2.3. Obtaining countable additivity 9 2.4. Integration for charges (signe...
متن کاملRepresentation Theorem for Hypergraph Satisfiability
Given a set of propositions, one can consider its inconsistency hypergraph. Then the safisfiability of sets of clauses with respect to that hypergraph (see [2], [4]) turns out to be the usual satisfiability. The problem is which hypergraphs can be obtained from sets of formulas as inconsistency hypergraphs. In the present paper it is shown that this can be done for all hypergraphs with countabl...
متن کاملRepresentation Theorems for Hypergraph Satisfiability
Given a set of propositions, one can consider its inconsistency hypergraph. Then the satisfiability of sets of clauses with respect to that hypergraph (see [1], [6]) turns out to be the usual satisfiability. The problem is which hypergraphs can be obtained from sets of formulas as inconsistency hypergraphs. In the present paper it is shown that this can be done for all hypergraphs with countabl...
متن کاملLearning a Hidden Hypergraph
We consider the problem of learning a hypergraph using edge-detecting queries. In this model, the learner may query whether a set of vertices induces an edge of the hidden hypergraph or not. We show that an r-uniform hypergraph with m edges and n vertices is learnable with O(24rm · poly(r, logn)) queries with high probability. The queries can be made in O(min(2r(logm + r)2, (logm + r)3)) rounds...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2022
ISSN: ['2227-7390']
DOI: https://doi.org/10.3390/math10111921